1943A - MEX Game 1 - CodeForces Solution


brute force games greedy

Please click on ads to support us..

Python Code:

t=int(input())
for j in range(0,t):
    n=int(input())
    a=[0]*n
    string=input()
    b=string.split(' ')
    cnt=[0]*(n+1)
    index=0
    for i in b:
        d=int(i)
        a[index]=d
        index+=1
        cnt[d]+=1
    ans=-1
    f=0
    for i in range(0,n):
        if cnt[i]==0:
            break
        if cnt[i]==1:
            if f==1:
                break
            f=1
            ans=i
        else:
            ans=i
            
    print(ans+1)


Comments

Submit
0 Comments
More Questions

811A - Vladik and Courtesy
1006B - Polycarp's Practice
1422A - Fence
21D - Traveling Graph
1559B - Mocha and Red and Blue
1579C - Ticks
268B - Buttons
898A - Rounding
1372B - Omkar and Last Class of Math
1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort